When Simpler Data Does Not Imply Less Information
نویسندگان
چکیده
منابع مشابه
When Projective Does Not Imply Flat , and Other Homological
If M is both an abelian category and a symmetric monoidal closed category, then it is natural to ask whether projective objects in M are at, and whether the tensor product of two projective objects is projective. In the most familiar such categories, the answer to these questions is obviously yes. However, the category M G of Mackey functors for a compact Lie group G is a category of this type ...
متن کاملSuperintelligence Does Not Imply Benevolence
Asmachines become capable ofmore autonomous and intelligent behavior, will they also display more morally desirable behavior? Earth’s history tends to suggest that increasing intelligence, knowledge, and rationality will result in more cooperative and benevolent behavior. Animals with sophisticated nervous systems track and punish exploitative behavior, while rewarding cooperation. Humans form ...
متن کاملWhen Does Determinacy Imply Expectational Stability?
We study the connections between determinacy of rational expectations equilibrium, and expectational stability or learnability of that equilibrium, in a relatively general New Keynesian model. Adoption of policies that induce both determinacy and learnability of equilibrium has been considered fundamental to successful policy in the literature. We ask what types of economic assumptions drive di...
متن کاملWhen does Functional Encryption Imply Obfuscation?
Realizing indistinguishablility obfuscation (IO) based on well-understood computational assumptions is an important open problem. Recently, realizing functional encryption (FE) has emerged as promising directing towards that goal. This is because: (1) compact single-key FE (where the functional secret-key is of length double the ciphertext length) is known to imply IO [Anath and Jain, CRYPTO 20...
متن کاملCount(q) Does Not Imply Count(p)
I solve a conjecture originally studied by M. Ajtai. It states that for different primes q, p the matching principles Count(q) and Count(p) are logically independent. I prove that this indeed is the case. Actually I show that Count(q) implies Count(p) exactly when each prime factor in p also is a factor in q. 1 The logic of elementary counting “She loves me, she loves me not, she loves me,. . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on the Web
سال: 2018
ISSN: 1559-1131,1559-114X
DOI: 10.1145/3143402